Complex Query JOIN Optimization in Parallel Distributed Environment
نویسندگان
چکیده
The research work covers the query optimization concept in parallel distributed environment. The queries considered are select-project-join (SPJ) queries with large databases. The main query operation considered for research is JOIN operation of the query. For fast execution of a complex query, JOIN operation time needs to be minimized. Different JOIN operation algorithms such as Network Byte Order (NBO) parallel two way semi JOIN with bit array, NBO parallel collision free intelligent bloom JOIN filter, NBO parallel positional encoded reduction filter (PERF) JOIN and NBO parallel distinct encoded reduction filter (DERF) JOIN are implemented and evaluated with existing algorithms.
منابع مشابه
Join Query Optimization in Parallel Database Systems
In this paper we present a new framework for studying parallel query optimization. We first note that scheduling and optimization must go together in a parallel environment. We introduce the concept of response time envelopes which integrates scheduling and optimization. We show that it can be used effectively to develop parallel query optimization algorithms which have same order of complexity...
متن کاملMobile Join Algorithms based on Mobiles Agents for Large Scale Distributed Query Optimization
In the large scale distributed environment, the query optimization presents new problems because of the data unavailability, the estimations inaccuracies and environment instability. In this paper, we address the sub-optimality of executions plans caused by these problems. We propose to extend the join algorithms based on mobile agents in order to correct the sub-optimality. This extension allo...
متن کاملParallel Processing of JOIN Queries in OGSA-DAI
JOIN Query is the most important and often most expensive of all relational operations, especially when its input is obtained from considerable size of tables on distributed heterogeneous database. As parallel join processing is a well understood technique to get results as quickly as possible, one way to speed up query execution is to exploit parallelism. Since most real queries involve joins ...
متن کاملDynamic Join Algorithm Switching at Query Execution Time
Join optimization is one of the most challenging tasks in query processing. The performance of joins depends not only on the algebraical/logical query execution plan (QEP), but also on the chosen join algorithms. Static optimization techniques often suffer from outdated or not available statistics on the data. This may result in sub-optimal QEPs and poor query execution times. Adaptive Query Pr...
متن کاملDynamic Join Order Optimization for SPARQL Endpoint Federation
The existing web of linked data inherently has distributed data sources. A federated SPARQL query system, which queries RDF data via multiple SPARQL endpoints, is expected to process queries on the basis of these distributed data sources. During a federated query, each data source may consist of a search space of nontrivial size. Therefore, finding the optimal join order to minimize the size of...
متن کامل